Low-Power Twiddle Factor Unit for FFT Computation
نویسندگان
چکیده
An integral part of FFT computation are the twiddle factors, which, in software implementations, are typically stored into RAM memory implying large memory footprint and power consumption. In this paper, we propose a novel twiddle factor generator based on reduced ROM tables. The unit supports both radix-4 and mixed-radix-4/2 FFT algorithms and several transform lengths. The unit operates at a rate of one factor per clock cycle.
منابع مشابه
Low- Power Split-radix Fft Processors Using Carry Select
Split-Radix Fast Fourier Transform (SRFFT) is mainly for the implementation of a low-power FFT processor. In FFT algorithms, SRFFT has less number of arithmetic operations. Twiddle factor is required in FFT addressing processors. The signal flow graph of SRFFT is the same as radix-2 FFT and so conventional addressing schemes is used in of SRFFT. However, it has improper arrangement of twiddle f...
متن کاملFPGA Implementation of a CORDIC-based Radix-8 FFT Processor for Real-Time Harmonic Analyzer
In this paper, the design of a CORDIC algorithm based radix8 FFT processor is presented for real-time harmonic analyzer. The actual need of FFT is the obtaining a levels of harmonics in power signal. Generally the radix-8 FFT processor is a twiddle factor based butterfly computation. At each stage of the butterfly the twiddle factor is multiplied with the input sequence and each stage required ...
متن کاملLow - Power Split - Radix Fft Processors
To design a split radix fast Fourier transform is an ideal person for the implementing of a low-power FFT processor, because it has the lowest number of arithmetic operations among all the FFT algorithms. In the design of such processor, an efficient addressing scheme for FFT data as well as twiddle factors is required. The signal flow of SRFFT is the same as a redix-2 FF, and conventional addr...
متن کاملReversible Logic Circuit Based Twiddle Factor Generation
An efficient hardware implementation of FFT algorithm become essential one in signal analysis domain, more specifically the twiddle factor calculation in FFT computation plays important role in the speed and efficiency of the complete process. World of computation needs the fast and efficient tools to match the need of present scenario, even though there are many methods proposed the Reversible...
متن کاملA high-speed low-complexity modified radix-25 FFT processor for gigabit WPAN applications
Abstract— In this paper, we present a novel modified radix-2 algorithm for 512-point fast Fourier transform (FFT) computation and high-speed eight-parallel data-path architecture for multi-gigabit wireless personal area network (WPAN) systems. The proposed FFT processor can provide a high data throughput and low hardware complexity by using eight-parallel data-path and multi-path delay-feedback...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007